- inner interpolation
- мат.внутренняя интерполяция
English-Russian scientific dictionary. 2008.
inner interpolation
Смотреть что такое "inner interpolation" в других словарях:
Sobolev space — In mathematics, a Sobolev space is a vector space of functions equipped with a norm that is a combination of Lp norms of the function itself as well as its derivatives up to a given order. The derivatives are understood in a suitable weak sense… … Wikipedia
Chebyshev polynomials — Not to be confused with discrete Chebyshev polynomials. In mathematics the Chebyshev polynomials, named after Pafnuty Chebyshev,[1] are a sequence of orthogonal polynomials which are related to de Moivre s formula and which can be defined… … Wikipedia
List of mathematics articles (I) — NOTOC Ia IA automorphism ICER Icosagon Icosahedral 120 cell Icosahedral prism Icosahedral symmetry Icosahedron Icosian Calculus Icosian game Icosidodecadodecahedron Icosidodecahedron Icositetrachoric honeycomb Icositruncated dodecadodecahedron… … Wikipedia
Bézier curve — Cubic Bézier curve A Bézier curve is a parametric curve frequently used in computer graphics and related fields. Generalizations of Bézier curves to higher dimensions are called Bézier surfaces, of which the Bézier triangle is a special case. In… … Wikipedia
Quaternion — Quaternions, in mathematics, are a non commutative extension of complex numbers. They were first described by the Irish mathematician Sir William Rowan Hamilton in 1843 and applied to mechanics in three dimensional space. They find uses in both… … Wikipedia
Algorithmus von Cohen-Sutherland — Der Algorithmus von Cohen Sutherland ist ein Algorithmus zum Clipping von Linien an einem Rechteck. Er ist nach seinen Erfindern Dan Cohen und Ivan Sutherland benannt. Der Algorithmus gilt als populärster, wenn auch nicht effizientester für seine … Deutsch Wikipedia
Cohen-Sutherland-Algorithmus — Der Algorithmus von Cohen Sutherland ist ein Algorithmus zum Clipping von Linien an einem Rechteck. Er ist nach seinen Erfindern Dan Cohen und Ivan Sutherland benannt. Der Algorithmus gilt als populärster, wenn auch nicht effizientester für seine … Deutsch Wikipedia
Padua points — In polynomial interpolation of two variables, the Padua points are the first known example (and up to now the only one) of unisolvent point set (that is, the interpolating polynomial is unique) with minimal growth of their Lebesgue constant,… … Wikipedia
Song Dynasty — This article is about the Northern and Southern Song Dynasties. For the Southern Dynasty, see Liu Song Dynasty. Song 宋 ← … Wikipedia
biblical literature — Introduction four bodies of written works: the Old Testament writings according to the Hebrew canon; intertestamental works, including the Old Testament Apocrypha; the New Testament writings; and the New Testament Apocrypha. The Old… … Universalium
Lanczos resampling — ( Lanzosh ) is a multivariate interpolation method used to compute new values for any digitally sampled data. It is often used to resize digital images, but could be used for any other digital signal. In the case of digital image resizing, the… … Wikipedia
